The Computational Power of Discrete Hoppeld Nets with Hidden Units
نویسنده
چکیده
We prove that polynomial size discrete Hoppeld networks with hidden units compute exactly the class of Boolean functions PSPACE/poly, i.e., the same functions as are computed by polynomial space-bounded nonuniform Turing machines. As a corollary to the construction, we observe also that networks with polynomially bounded interconnection weights compute exactly the class of functions P/poly, i.e., the class computed by polynomial time-bounded nonuniform Turing machines.
منابع مشابه
A Continuous-time Hoppeld Net Simulation of Discrete Neural Networks a Continuous-time Hoppeld Net Simulation of Discrete Neural Networks
We investigate the computational power of continuous-time symmetric Hoppeld nets. Since the dynamics of such networks are governed by Liapunov (energy) functions, they cannot generate innnite nondamping oscillations, and hence cannot simulate arbitrary (potentially divergent) discrete computations. Nevertheless, we prove that any conver-gent fully parallel computation by a network of n discrete...
متن کاملA Continuous-time Hoppeld Net Simulation of Discrete Neural Networks Institute of Computer Science Academy of Sciences of the Czech Republic a Continuous-time Hoppeld Net Simulation of Discrete Neural Networks
We investigate the computational power of continuous-time symmetric Hoppeld nets. Since the dynamics of such networks are governed by Liapunov (energy) functions, they cannot generate innnite nondamping oscillations, and hence cannot simulate arbitrary (potentially divergent) discrete computations. Nevertheless, we prove that any conver-gent fully parallel computation by a network of n discrete...
متن کاملComplexity Issues in Discrete Hoppeld Networks
We survey some aspects of the computational complexity theory of discrete-time and discrete-state Hoppeld networks. The emphasis is on topics that are not adequately covered by the existing survey literature, most signiicantly: 1. the known upper and lower bounds for the convergence times of Hoppeld nets (here we consider mainly worst-case results); 2. the power of Hoppeld nets as general compu...
متن کاملComplexity Issues in Discrete Hop eldNetworks
We survey some aspects of the computational complexity theory of discrete-time and discrete-state Hoppeld networks. The emphasis is on topics that are not adequately covered by the existing survey literature, most signiicantly: 1. the known upper and lower bounds for the convergence times of Hoppeld nets (here we consider mainly worst-case results); 2. the power of Hoppeld nets as general compu...
متن کاملComplexity Issues in Discrete Hop
We survey some aspects of the computational complexity theory of discrete-time and discrete-state Hoppeld networks. The emphasis is on topics that are not adequately covered by the existing survey literature, most signiicantly: 1. the known upper and lower bounds for the convergence times of Hop-eld nets (here we consider mainly worst-case results); 2. the power of Hoppeld nets as general compu...
متن کامل